منابع مشابه
Unambiguous Automata
We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second one gives a cubic bound for the minimal length of a synchronizing pair in a complete synchronized unambiguous automaton. The proofs are based on results on unambiguous monoids of relations. Mathematics Subject Classifi...
متن کاملUnambiguous Computation
This survey paper is designed to review the literature on unambiguous computation. Broadly speaking, studying unambiguous computation is an attempt to determine how much of the power of non-determinism comes from the ability to accept many di↵erent proofs of the same statement. The literature on this subject is of both practical and philosophical interest, and the Isolating lemma of Mulmuley, V...
متن کاملUnambiguous Triggers
Triggers for parameter setting may be ambiguous. Strategies for dealing with ambiguity include guessing, parallel processing, and waiting for unambiguous input. The Trigger Learning Algorithm of Gibson and Wexler (1994) is a guessing system. Gibson and Wexler show that under some reasonable assumptions it may never attain the target grammar. I propose instead a deterministic device that waits f...
متن کاملThe Mesoproterozoic – no “boring billion”
The authors show that the Mesoproterozoic (1.6-1.0 bn year before present) was no “boring billion” but a “bustling billion” - not only with Stromatolites and their apex in the Calymmian and Ectasian but also with the presence of multicellular organisms. To make it visible a graphical reconstruction was created. For a long time, it was assumed that there existed no noteworthy biosphere on Earth ...
متن کاملMaking Nondeterminism Unambiguous 1
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of problems reducible to context-free languages. In terms of complexity classes, this can be stated as: NL/poly = UL/poly LogCFL/poly = UAuxPDA(log n; nO(1))/poly
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1971
ISSN: 0028-0836,1476-4687
DOI: 10.1038/234426a0